An Energy-Efficient MCDS-based Routing Algorithm for Wireless Sensor Networks: Learning Automata Approach

Wireless sensor networks which are used to monitor and control a specific area, are made of many small sensor nodes; they are compressed and spread in an environment. One of the most challenges in these types of networks is Energy limitation which has direct influence on sensor network lifetime. Unicast routing in wireless sensor networks is a way for data delivery to a receiver. In this paper we are intended to present a unicast routing algorithm in wireless sensor networks, and we make a virtual backbone out of Minimum Connected Dominating Set (MCDS). This virtual backbone is initiated according to Energy level, Neighboring, and distance from Sink node. So, to this end we use an algorithm based on learning automata named UMCDSLA deal with the unicast routing problem. Finally, we simulate proposed method by ns2 simulator. Thus the results show high performance of the proposed algorithm. Streszczenie. W artykule zaprezentowano algorytm routowania typu unicast w sieci bezprzewodowej (ang. Wireless Sensor Network). Szkielet sieci oparty został na strukturze typu MCDS (ang. Minimum Connected Dominating Set). Do realizacji wykorzystano algorytm oparty na automacie uczącym się UMCDS-LA. Metodę przebadano na symulatorze ns2. (Energowydajny algorytm routowania w sieciach bezprzewodowych oparty na strukturze MCDS – automaty uczące się)